Automatic derivation of probabilistic inference rules
نویسنده
چکیده
A probabilistic inference rule is a general rule that provides bounds on a target probability given constraints on a number of input probabilities. Example: from P (AjB) r infer P (:AjB) 2 [1 r; 1℄. Rules of this kind have been studied extensively as a deduction method for propositional probabilistic logics. Many different rules have been proposed, and their validity proved – often with substantial effort. Building on previous work by T. Hailperin, in this paper we show that probabilistic inference rules can be derived automatically, i.e. given the input constraints and the target probability, one can automatically derive the optimal bounds on the target probability as a functional expression in the parameters of the input constraints.
منابع مشابه
Extending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملRule-based joint fuzzy and probabilistic networks
One of the important challenges in Graphical models is the problem of dealing with the uncertainties in the problem. Among graphical networks, fuzzy cognitive map is only capable of modeling fuzzy uncertainty and the Bayesian network is only capable of modeling probabilistic uncertainty. In many real issues, we are faced with both fuzzy and probabilistic uncertainties. In these cases, the propo...
متن کاملA modified Apriori algorithm to generate rules for inference system with probabilistic-fuzzy knowledge base
In the article the possibility of applying one of the methods of data mining – fuzzy association rules to model fuzzy systems is presented. The algorithm of automatic extracting knowledge base is a modification of the Apriori algorithm. The obtained rules of the model contain weights, that are calculated on the basis of measures of fuzzy association rules and constitute probability of fuzzy eve...
متن کاملDouble Derivations, Higher Double Derivations and Automatic Continuity
Let be a Banach algebra. Let be linear mappings on . First we demonstrate a theorem concerning the continuity of double derivations; especially that all of -double derivations are continuous on semi-simple Banach algebras, in certain case. Afterwards we define a new vocabulary called “-higher double derivation” and present a relation between this subject and derivations and finally give some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 28 شماره
صفحات -
تاریخ انتشار 2001